翻訳と辞書 Words near each other ・ Penalty (gridiron football) ・ Penalty (ice hockey) ・ Penalty (Mormonism) ・ Penalty (rugby union) ・ Penalty (rugby) ・ Penalty (sports manufacturer) ・ Penalty area ・ Penalty box ・ Penalty card ・ Penalty corner ・ Penalty fare ・ Penalty flag ・ Penalty kick ・ Penalty Life ・ Penalty marker ・ Penalty method ・ Penalty Phase ・ Penalty points in Ireland ・ Penalty Recordings ・ Penalty shoot-out (association football) ・ Penalty shoot-out (field hockey) ・ Penalty shootout ・ Penalty shot ・ Penalty shot (ice hockey) ・ Penalty stroke ・ Penalty unit ・ Penalva ・ Penalva do Castelo ・ Penalves ・ Penam Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Penalty method ： ウィキペディア英語版 Penalty method Penalty methods are a certain class of algorithms for solving constrained optimization problems. A penalty method replaces a constrained optimization problem by a series of unconstrained problems whose solutions ideally converge to the solution of the original constrained problem. The unconstrained problems are formed by adding a term, called a penalty function, to the objective function that consists of a ''penalty parameter'' multiplied by a measure of violation of the constraints. The measure of violation is nonzero when the constraints are violated and is zero in the region where constraints are not violated. == Example == Let us say we are solving the following constrained problem: :$\backslash min\; f(\backslash bold\; x)$ subject to :$c\_i(\backslash bold\; x)\; \backslash ge\; 0\; ~\backslash forall\; i\; \backslash in\; I.$ This problem can be solved as a series of unconstrained minimization problems :$\backslash min\; \backslash Phi\_k\; (\backslash bold\; x)\; =\; f\; (\backslash bold\; x)\; +\; \backslash sigma\_k\; ~\; \backslash sum\_\; ~\; g(c\_i(\backslash bold\; x))$ where :$g(c\_i(\backslash bold\; x))=\backslash min(0,~c\_i(\backslash bold\; x\; ))^2.$ In the above equations, $g(c\_i(\backslash bold\; x))$ is the ''penalty function'' while $\backslash sigma\_k$ are the ''penalty coefficients''. In each iteration ''k'' of the method, we increase the penalty coefficient $\backslash sigma\_k$ (e.g. by a factor of 10), solve the unconstrained problem and use the solution as the initial guess for the next iteration. Solutions of the successive unconstrained problems will eventually converge to the solution of the original constrained problem. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Penalty method」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.